Extremal traceable graphs with non-traceable edges
نویسندگان
چکیده
منابع مشابه
Scenic graphs II: non-traceable graphs
A path of a graph is maximal if it is not a proper subpath of any other path of the graph. A graph is scenic if every maximal path of the graph is a maximum length path. In [4] we give a new proof of C. Thomassen's result characterizing all scenic graphs with Hamiltonian path. Using similar methods here we determine all scenic graphs with no Hamiltonian path.
متن کاملOn non-traceable, non-hypotraceable, arachnoid graphs
Motivated by questions concerning optical networks, in 2003 Gargano, Hammar, Hell, Stacho, and Vaccaro defined the notions of spanning spiders and arachnoid graphs. A spider is a tree with at most one branch (vertex of degree at least 3). The spider is centred at the branch vertex (if there is any, otherwise it is centred at any of the vertices). A graph is arachnoid if it has a spanning spider...
متن کاملHamiltonicity of k-Traceable Graphs
Let G be a graph. A Hamilton path in G is a path containing every vertex of G. The graph G is traceable if it contains a Hamilton path, while G is k-traceable if every induced subgraph of G of order k is traceable. In this paper, we study hamiltonicity of k-traceable graphs. For k ≥ 2 an integer, we define H(k) to be the largest integer such that there exists a k-traceable graph of order H(k) t...
متن کاملTraceable Visual Cryptography Traceable Visual Cryptography
In this paper we present a new k out of n visual cryptography scheme which does not only meet the requirements of the basic visual cryptography scheme deened by Naor and Shamir 5] but is also traceable. With a k out of n scheme it is not possible to reveal the original secret by stacking less than k transparencies. In general one can assume that it is very unlikely that there are k shareholders...
متن کاملCycles in k-traceable oriented graphs
A digraph of order at least k is termed k-traceable if each of its subdigraphs of order k is traceable. It turns out that several properties of tournaments—i.e., the 2-traceable oriented graphs—extend to k-traceable oriented graphs for small values of k. For instance, the authors together with O. Oellermann have recently shown that for k = 2, 3, 4, 5, 6, all ktraceable oriented graphs are trace...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2009
ISSN: 1232-9274
DOI: 10.7494/opmath.2009.29.1.89